package com.lyz.dataStructure.LeetCode.dongtaiguihua;


import java.util.Arrays;
import java.util.Scanner;

public class Solution4 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        int n = sc.nextInt();
        System.out.println(uniquePath(m,n));
    }

    public static int uniquePath (int m,int n){
        int[] dp = new int[n];
        Arrays.fill(dp,1);
        for(int i =1;i<m;i++){
            for(int j =1;j<n;j++){
                dp[j] = dp[j]+dp[j-1];
            }
        }
        return dp[n-1];
    }
}
